Improved lower bound for the vertex connectivity of (δ; g)-cagesYUQING LIN; MILLER, Mirka; BALBUENA, Camino et al.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 162-171, issn 0012-365X, 10 p.Article

On the connectivity of (k, g)-cages of even girthYUQING LIN; BALBUENA, Camino; MARCOTE, Xavier et al.Discrete mathematics. 2008, Vol 308, Num 15, pp 3249-3256, issn 0012-365X, 8 p.Article

Minimum cost source location problem with local 3-vertex-connectivity requirementsISHII, Toshimasa; FUJITA, Hitoshi; NAGAMOCHI, Hiroshi et al.Theoretical computer science. 2007, Vol 372, Num 1, pp 81-93, issn 0304-3975, 13 p.Article

Maintaining the 3-edge-connected components of a graph on-lineZVI GALIL; ITALIANO, G. F.SIAM journal on computing (Print). 1993, Vol 22, Num 1, pp 11-28, issn 0097-5397Article

Connectivity of the Mycielskian of a digraphLITAO GUO; XIAOFENG GUO.Applied mathematics letters. 2009, Vol 22, Num 10, pp 1622-1625, issn 0893-9659, 4 p.Article

The least eigenvalue of graphs with given connectivityYE, Miao-Lin; FAN, Yi-Zheng; DONG LIANG et al.Linear algebra and its applications. 2009, Vol 430, Num 4, pp 1375-1379, issn 0024-3795, 5 p.Article

Laplacian integral graphs in S(a, b)SILVA DE LIMA, Leonardo; MAIA DE ABREU, Nair Maria; SILVA OLIVEIRA, Carla et al.Linear algebra and its applications. 2007, Vol 423, Num 1, pp 136-145, issn 0024-3795, 10 p.Conference Paper

Connectivity of the Mycielskian of a graphBALAKRISHNAN, R; FRANCIS RAJ, S.Discrete mathematics. 2008, Vol 308, Num 12, pp 2607-2610, issn 0012-365X, 4 p.Article

Labeling schemes for flow and connectivityKATZ, Michal; KATZ, Nir A; KORMAN, Amos et al.SIAM journal on computing (Print). 2005, Vol 34, Num 1, pp 23-40, issn 0097-5397, 18 p.Article

Hardness of approximation for vertex-connectivity network design problemsKORTSARZ, Guy; KRAUTHGAMER, Robert; LEE, James R et al.SIAM journal on computing (Print). 2004, Vol 33, Num 3, pp 704-720, issn 0097-5397, 17 p.Article

Maintenance of 2- and 3-edge-connected components of graphs IILA POUTRE, Han.SIAM journal on computing (Print). 2000, Vol 29, Num 5, pp 1521-1549, issn 0097-5397Article

Maximum Zagreb index, minimum hyper-Wiener index and graph connectivityBEHTOEI, A; JANNESARI, M; TAERI, B et al.Applied mathematics letters. 2009, Vol 22, Num 10, pp 1571-1576, issn 0893-9659, 6 p.Article

Augmenting a (k - 1)-vertex-connected multigraph to an ł-edge-connected and k-vertex-connected multigraphISHII, Toshimasa; NAGAMOCHI, Hiroshi; IBARAKI, Toshihide et al.Algorithmica. 2006, Vol 44, Num 3, pp 257-280, issn 0178-4617, 24 p.Article

Conjectures on index and algebraic connectivity of graphsDAS, Kinkar Ch.Linear algebra and its applications. 2010, Vol 433, Num 8-10, pp 1666-1673, issn 0024-3795, 8 p.Article

Bi-connectivity augmentation for specified vertices of a graph with upper bounds on vertex-degree increase : Spection section on foundations of computer scienceMASHIMA, Toshiya; FUKUOKA, Takanori; TAOKA, Satoshi et al.IEICE transactions on information and systems. 2006, Vol 89, Num 2, pp 751-762, issn 0916-8532, 12 p.Article

Restricted connectivity for three families of interconnection networksCHEN, Y-Chuang; TAN, Jimmy J. M.Applied mathematics and computation. 2007, Vol 188, Num 2, pp 1848-1855, issn 0096-3003, 8 p.Article

Maximally edge-connected and vertex-connected graphs and digraphs : A surveyHELLWIG, Angelika; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 15, pp 3265-3296, issn 0012-365X, 32 p.Article

Sparse connectivity certificates via MA orderings in graphsNAGAMOCHI, Hiroshi.Discrete applied mathematics. 2006, Vol 154, Num 16, pp 2411-2417, issn 0166-218X, 7 p.Conference Paper

On the distance spectral radius of bipartite graphsNATH, Milan; PAUL, Somnath.Linear algebra and its applications. 2012, Vol 436, Num 5, pp 1285-1296, issn 0024-3795, 12 p.Article

On constructing k-connected k-dominating set in wireless ad hoc and sensor networksFEI DAI; JIE WU.Journal of parallel and distributed computing (Print). 2006, Vol 66, Num 7, pp 947-958, issn 0743-7315, 12 p.Conference Paper

The source location problem with local 3-vertex-connectivity requirementsISHII, Toshimasa; FUJITA, Hitoshi; NAGAMOCHI, Hiroshi et al.Discrete applied mathematics. 2007, Vol 155, Num 18, pp 2523-2538, issn 0166-218X, 16 p.Article

Algorithms for minimum m-connected k-tuple dominating set problemWEIPING SHANG; PENGJUN WAN; FRANCES YAO et al.Theoretical computer science. 2007, Vol 381, Num 1-3, pp 241-247, issn 0304-3975, 7 p.Article

Progressive Light Transport Simulation on the GPU: Survey and ImprovementsDAVIDOVIC, Tomáš; KRIVANEK, Jaroslav; HASAN, Miloš et al.ACM transactions on graphics. 2014, Vol 33, Num 3, issn 0730-0301, 29.1-29.19Article

The complexity of determining the rainbow vertex-connection of a graphLILY CHEN; XUELIANG LI; YONGTANG SHI et al.Theoretical computer science. 2011, Vol 412, Num 35, pp 4531-4535, issn 0304-3975, 5 p.Article

Approximating node connectivity problems via set coversKORTSARZ, Guy; NUTOV, Zeev.Algorithmica. 2003, Vol 37, Num 2, pp 75-92, issn 0178-4617, 18 p.Article